Computation of the signed distance function to a discrete contour on adapted triangulation
نویسندگان
چکیده
In this paper, we propose a numerical method for computing the signed distance function to a discrete domain, on an arbitrary triangular background mesh. It mainly relies on the use of some theoretical properties of the unsteady Eikonal equation. Then we present a way of adapting the mesh on which computations are held to enhance the accuracy for both the approximation of the signed distance function and the approximation of the initial discrete contour by the induced piecewise affine reconstruction, which is crucial when using this signed distance function in a context of level set methods. Several examples are presented to assess our analysis, in two or three dimensions.
منابع مشابه
Chordal Axis on Weighted Distance Transforms
Chordal Axis (CA) is a new representation of planar shapes introduced by Prasad in [7], useful for skeleton computation, shape analysis, characterization and recognition. The CA is a subset of chord and center of disks tangent to the contour of a shape, derivated from Medial Axis (MA). Originally presented in a computational geometry approach, the CA was extracted on a constrained Delaunay tria...
متن کاملFast and Regularization less Active Contour
The application of the level set method in image segmentation has been very popular due to its capability of automatically handling changes in topology. However, a re-initialization procedure, which leads to expensive computation, is required in the traditional level set method to keep the level set function as a signed distance function to its interface. A method based on Gaussian filtering an...
متن کاملTESTING STATISTICAL HYPOTHESES UNDER FUZZY DATA AND BASED ON A NEW SIGNED DISTANCE
This paper deals with the problem of testing statisticalhypotheses when the available data are fuzzy. In this approach, wefirst obtain a fuzzy test statistic based on fuzzy data, and then,based on a new signed distance between fuzzy numbers, we introducea new decision rule to accept/reject the hypothesis of interest.The proposed approach is investigated for two cases: the casewithout nuisance p...
متن کاملDirect Contouring of Implicit Closest Point Surfaces
Constructing a (signed) distance field and contouring its zero level set are two important steps in many surface reconstruction methods. While most high-quality distance transforms compute the distance to the surface as well as the closest point on it, the contouring step typically uses only the distance and omits the closest point information. Our novel closest point contouring algorithm (CPC)...
متن کاملMultivariate spline approximation of the signed distance function
The signed distance function can effectively support many geometry processing tasks such as decimates, smoothing and shape reconstruction since it provides efficient access to distance estimates. In this talk, we present an adaptive method to approximate the signed distance function of a smooth curve by using polynomial splines over type-2 triangulation. The trimmed offsets are also studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012